منابع مشابه
Solving a fuzzy set-covering problem
K e y w o r d s S e t c o v e r i n g problems, Fuzzy sets, Fuzzy set-covering problem, Algebraic sum operator. 1. I N T R O D U C T I O N A classical set-covering problem considers the subsets I = {1, 2 , . . . , m} and J = {1, 2 , . . . , n} of integers. A collection p of subset Pj of I is a cover of I, if the union of the members of go is I, i.e., let Pj C I, go = {Pj : j C J0}, J0 C J, go i...
متن کاملEnumeration Technique for Solving Linear Fractional Fuzzy Set Covering Problem
In this paper an enumeration technique for solving linear fractional fuzzy set covering problem is defined. Set covering problems belong to the class of 0-1 integer programming problems that are NP-complete. Many applications arises having the set covering problems, switching theory, testing of VLSI circuits and line balancing often take on a set covering structure. Linear fractional set coveri...
متن کاملSolving Set Covering Problem with Fireworks Explosion
To solve the Set Covering Problem we will use a metaheuristic Fireworks Algorithm inspired by the fireworks explosion. Through the observation of the way that fireworks explode is much similar to the way that an individual searches the optimal solution in swarm. Fireworks algorithm (FWA) consists of four parts, i.e., the explosion operator, the mutation operator, the mapping rule and selection ...
متن کاملA Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملBiogeography-Based Optimization Algorithm for Solving the Set Covering Problem
Biogeography-Based Optimization Algorithm (BBOA) is a kind of new global optimization algorithm inspired by biogeography. It mimics the migration behavior of animals in nature to solve optimization and engineering problems. In this paper, BBOA for the Set Covering Problem (SCP) is proposed. SCP is a classic combinatorial problem from NP-hard list problems. It consist to find a set of solutions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2004
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2004.10.015